QMR Smoothing for Lanczos-Type Product Methods Based on Three-Term Rrecurrences

نویسندگان

  • Klaus J. Ressel
  • Martin H. Gutknecht
چکیده

For the solution of large, sparse, non-Hermitian linear systems, Lanczos-type product methods that are based on the Lanczos three-term recurrence are derived in a systematic way. These methods either square the Lanczos process or combine it with a local minimization of the residual. For them a quasi-minimal residual (QMR) smoothing is proposed that can also be implemented by short-term recurrences. The practical performance of these methods and the QMR smoothing is demonstrated in a number of numerical examples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Implementation of the QMR Method Based on Coupled Two-Term Recurrences

Recently, the authors have proposed a new Krylov subspace iteration, the quasi-minimal residual algorithm (QMR), for solving non-Hermitian linear systems. In the original implementation of the QMR method, the Lanczos process with look-ahead is used to generate basis vectors for the underlying Krylov subspaces. In the Lanczos algorithm, these basis vectors are computed by means of three-term rec...

متن کامل

Look-Ahead Procedures for Lanczos-Type Product Methods Based on Three-Term Lanczos Recurrences

Lanczos-type product methods for solving large sparse non-Hermitian linear systems have as residual polynomials either the squares of the Lanczos polynomials or the products of the latter with another sequence of polynomials, which is normally chosen to enforce some local minimization of the residual norm. In either case, these methods inherit from the underlying Lanczos process the danger of b...

متن کامل

The Non-Symmetric s-Step Lanczos Algorithm: Derivation Of Efficient Recurrences And Synchronization-Reducing Variants Of BiCG And QMR

The Lanczos algorithm is among the most frequently used iterative techniques for computing a few dominant eigenvalues of a large sparse non-symmetric matrix. At the same time, it serves as a building block within biconjugate gradient (BiCG) and quasi-minimal residual (QMR) methods for solving large sparse non-symmetric systems of linear equations. It is well known that, when implemented on dist...

متن کامل

A new Lanczos-based algorithm for simulating high-frequency two-dimensional electron spin resonance spectra.

The Lanczos algorithm (LA) is a useful iterative method for the reduction of a large matrix to tridiagonal form. It is a storage efficient procedure requiring only the preceding two Lanczos vectors to compute the next. The quasi-minimal residual (QMR) method is a powerful method for the solution of linear equation systems, Ax = b. In this report we provide another application of the QMR method:...

متن کامل

A Parallel Version of the Unsymmetric Lanczos Algorithm and its Application to QMR

A new version of the unsymmetric Lanczos algorithm without look-ahead is described combining elements of numerical stability and parallel algorithm design. Firstly, stability is obtained by a coupled two-term procedure that generates Lanczos vectors scaled to unit length. Secondly, the algorithm is derived by making all inner products of a single iteration step independent such that global sync...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 19  شماره 

صفحات  -

تاریخ انتشار 1998